Unsatisfiable hitting clause-sets with three more clauses than variables

نویسندگان

  • Oliver Kullmann
  • Xishun Zhao
چکیده

Hitting clause-sets (as CNFs), known in DNF language as “disjoint” or “orthogonal”, are clause-sets F , such that any C,D ∈ F , C 6= D, have a literal x ∈ C with x ∈ D. The set of unsatisfiable such F is denoted by UHIT ⊂ MU (minimal unsatisfiability). A basic fact is δ(F ) ≥ 1 for F ∈ MU , where the deficiency δ(F ) := c(F ) − n(F ) is the difference between the number of clauses and the number of variables. Via the known singular DP-reduction, generalising unit-clause propagation, every F ∈ UHIT can be reduced to its (unique) “nonsingular normal form” sNF(F ) ∈ UHIT ′, where δ(sNF(F )) = δ(F ), and UHIT ′ ⊂ UHIT is the subset of non-singular elements, i.e., every variable occurs positively as well as negatively at least twice. The Finiteness Conjecture (FC) is that for every k ∈ N the number n(F ) of variables for F ∈ UHIT ′ with δ(F ) = k is bounded. This conjecture is part of the project of classifying UHITδ=k. In this report we prove FC for k = 3 (known for k ≤ 2). For this, a central novel concept is transferred from number theory (Berger et al 1990 [2]), namely the fundamental notion of clause-irreducible clause-sets F , having no non-trivial clausefactors F ′, which are F ′ ⊆ F logically equivalent to some clause. The derived factorisations allow to reduce FC to the clause-irreducible case. Another new tool is nearly-full-subsumption resolution (nfs-resolution), which allows to change certain pairs C,D of clauses. Clause-sets which become clause-reducible after a series of nfs-resolutions are called nfsreducible, and we can furthermore reduce FC to the nfs-irreducible case.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constraint satisfaction problems in clausal form

This is the report-version of a mini-series of two articles [60, 61] on the foundations of conjunctive normal forms with non-boolean variables. These two parts are here bundled in one report, each part yielding a chapter. Part I We consider the problem of generalising boolean formulas in conjunctive normal form by allowing non-boolean variables, with the goal of maintaining combinatorial proper...

متن کامل

Parameters for minimal unsatisfiability: Smarandache primitive numbers and full clauses

We establish a new bridge between propositional logic and elementary number theory. A full clause contains all variables, and we study them in minimally unsatisfiable clause-sets (MU); such clauses are strong structural anchors, when combined with other restrictions. Counting the maximal number of full clauses for a given deficiency k, we obtain a close connection to the so-called “Smarandache ...

متن کامل

Disjoint DNF Tautologies with Conflict Bound Two

Many aspects of the relation of different decision tree and DNF complexity measures of Boolean functions have been more or less substantially explored. This paper adds a new detail to the picture: we prove that DNF tautologies with terms conflicting in one or two variables pairwise possess a tree-like structure. An equivalent reformulation of this result (adopting the terminology of [7, 8, 9]) ...

متن کامل

Lean clause-sets: generalizations of minimally unsatisfiable clause-sets

We study the problem of (eeciently) deleting such clauses from conjunctive normal forms (clause-sets) which can not contribute to any proof of unsatissability. For that purpose we introduce the notion of an autarky system, associated with a canonical normal form for every clause-set by deleting superruous clauses. Clause-sets where no clauses can be deleted are called lean, a natural generaliza...

متن کامل

On Variables with Few Occurrences in Conjunctive Normal Forms

We consider the question of the existence of variables with few occurrences in boolean conjunctive normal forms (clause-sets). Let μvd(F ) for a clause-set F denote the minimal variable-degree, the minimum of the number of occurrences of variables. Our main result is an upper bound μvd(F ) ≤ nM(σ(F )) ≤ σ(F ) + 1 + log 2 (σ(F )) for lean clause-sets F in dependency on the surplus σ(F ). Lean cl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1604.01288  شماره 

صفحات  -

تاریخ انتشار 2016